Increased Complexity Means Trickier Telemetry Problems

Robots Solving Serial Means-Means-End Problems

Recently, Auersperg et al. [1] demonstrated that Goffin’s cockatoos (Cacatua goffini) are able to solve complex means-means-end problems. This is an impressive cognitive ability and it is desirable to build models to understand such abilities. In this paper we describe a project that models such behavior and recreates the experiment on a robotic platform. First preliminary results suggest that ...

Incremental increased complexity training

Problems of Unknown Complexity

We consider three computational problems with unknown complexity status: The graph isomorphism problem, the problem of computing van der Waerden numbers and the problem of computing Ramsey numbers. For each of the problems, we devise an algorithm that we analyze with theoretical and practical means by a comparison with contemporary algorithms that solve the respective problems. The ScrewBox alg...

Identifying Complexity by Means of Matrices

Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related characteristics. Based on several natural complex dynamical systems, like the strongly interacting quantum many-body systems, the human brain and the financia...

The Complexity of the k-means Method

The k-means method is a widely used technique for clustering points in Euclidean space. While it is extremely fast in practice, its worst-case running time is exponential in the number of data points. We prove that the k-means method can implicitly solve PSPACE-complete problems, providing a complexity-theoretic explanation for its worst-case running time. Our result parallels recent work on th...